Totally odd subdivisions and parity subdivisions: Structures and Coloring
نویسنده
چکیده
A totally odd H-subdivision means a subdivision of a graph H in which each edge of H corresponds to a path of odd length. Thus this concept is a generalization of a subdivision of H. In this paper, we give a structure theorem for graphs without a fixed graph H as a totally odd subdivision. Namely, every graph with no totally odd H-subdivision has a tree-decomposition such that each piece is either 1. after deleting bounded number of vertices, an “almost” embedded graph into a bounded-genus surface, or 2. after deleting bounded number of vertices, a bipartite graph, or 3. after deleting bounded number of vertices, a graph with maximum degree at most f(|H|) for some function f of |H| (or a 6|H|-degenerate graph). Moreover, we can obtain either a totally odd Kksubdivision or such a tree-decomposition in polynomial time. We note that for minor-free graphs, we just need the first structure [37], while for odd-minor-free graphs, we need the first two structures [10]. For subdivisionfree graphs, we need the first and the third structures [17, 29]. So our result can be viewed as a combination of odd-minor-free graphs and subdivision-free graphs. The same conclusion of the structure theorem is true if we replace “totally odd” by “parity”. Hence this generalizes the structure theorem for subdivision-free graphs [17, 29]. We also consider coloring of graphs with no totally odd Kk-subdivision. We prove that any graph with no totally odd Kk-subdivision is 79k /4-colorable. The ∗National Institute of Informatics and JST ERATO Kawarabayashi Project, 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo,
منابع مشابه
On a theorem of Sewell and Trotter
Sewell and Trotter proved that every connected α-critical graph that is not isomorphic to K1,K2 or an odd cycle contains a totally odd K4-subdivision. Their theorem implies an interesting min-max relation for stable sets in graphs without totally odd K4-subdivisions. In this note, we give a simpler proof of Sewell and Trotter’s theorem.
متن کاملThe Charney-Davis Conjecture for Certain Subdivisions of Spheres
Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced, and some of their basic properties are verified. The Charney-Davis conjecture is then proven for odd iterated stellar subdivisions of sesquiconstructible balls and spheres.
متن کاملRecognizing a totally odd K 4 - subdivision , parity 2 - disjoint rooted paths and a parity cycle through specified elements ( extended abstract ) ∗
A totally odd K4-subdivision is a subdivision of K4 where each subdivided edge has odd length. The recognition of a totally odd K4-subdivision plays an important role in both graph theory and combinatorial optimization. Sewell and Trotter [53], Zang [63] and Thomassen [60] independently conjectured the existence of a polynomial time recognition algorithm. In this paper, we give the first polyno...
متن کاملReducing Computational and Memory Cost of Substructuring Technique in Finite Element Models
Substructuring in the finite element method is a technique that reduces computational cost and memory usage for analysis of complex structures. The efficiency of this technique depends on the number of substructures in different problems. Some subdivisions increase computational cost, but require little memory usage and vice versa. In the present study, the cost functions of computations and me...
متن کامل